Polynomials and Vandermonde Matrices over the Field of Quaternions
نویسنده
چکیده
It is known that the space of real valued, continuous functions C(B) over a multidimensional compact domain B ⊂ R , k ≥ 2 does not admit Haar spaces, which means that interpolation problems in finite dimensional subspaces V of C(B) may not have a solutions in C(B). The corresponding standard short and elegant proof does not apply to complex valued functions over B ⊂ C. Nevertheless, in this situation Haar spaces V ⊂ C(B) exist. We are concerned here with the case of quaternionic valued, continuous functions C(B) where B ⊂ H and H denotes the skew field of quaternions. Again, the proof is not applicable. However, we show that the interpolation problem is not unisolvent, by constructing quaternionic entries for a Vandermonde matrix V such that V will be singular for all orders n > 2. In addition, there is a section on the exclusion and inclusion of all zeros in certain balls in H for general quaternionic polynomials.
منابع مشابه
Fast approximate computations with Cauchy matrices and polynomials
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grew to quadratic for numerical solution. We fix this discrepancy: our new numerical algorithms run in nearly linear arithmetic time. At first we restate our goals as t...
متن کاملA brief introduction to quaternion matrices and linear algebra and on bounded groups of quaternion matrices
The division algebra of real quaternions, as the only noncommutative normed division real algebra up to isomorphism of normed algebras, is of great importance. In this note, first we present a brief introduction to quaternion matrices and quaternion linear algebra. This, among other things, will help us present the counterpart of a theorem of Herman Auerbach in the setting of quaternions. More ...
متن کاملA Traub–like algorithm for Hessenberg-quasiseparable-Vander- monde matrices of arbitrary order
Although Gaussian elimination uses O(n) operations to invert an arbitrary matrix, matrices with a special Vandermonde structure can be inverted in only O(n) operations by the fast Traub algorithm. The original version of Traub algorithm was numerically unstable although only a minor modification of it yields a high accuracy in practice. The Traub algorithm has been extended from Vandermonde mat...
متن کاملPolynomial Evaluation and Interpolation and Transformations of Matrix Structures
Multipoint polynomial evaluation and interpolation are fundamental for modern numerical and symbolic computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to quadratic for numerical solution. We decrease this cost dramatically and for a large class of inputs yield nearly linear time as well. We first restate our task...
متن کاملA Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices
The results on Vandermonde-like matrices were introduced as a generalization of polynomial Vandermonde matrices, and the displacement structure of these matrices was used to derive an inversion formula. In this paper we first present a fast Gaussian elimination algorithm for the polynomial Vandermonde-like matrices. Later we use the said algorithm to derive fast inversion algorithms for quasise...
متن کامل